On the eccentric distance sum of trees and unicyclic graphs
نویسندگان
چکیده
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملThe eccentric-distance sum of some graphs
Let G = (V,E) be a simple connected graph. The eccentric-distance sum of G is defined as ξ(G) = ∑ {u,v}⊆V (G) [e(u) + e(v)]d(u, v), where e(u) is the eccentricity of the vertex u in G and d(u, v) is the distance between u and v. In this paper, we establish formulae to calculate the eccentric-distance sum for some graphs, namely wheel, star, broom, lollipop, double star, friendship, multi-star g...
متن کاملExtremal values on the eccentric distance sum of trees
Abstract: Let G = (VG, EG) be a simple connected graph. The eccentric distance sum of G is defined as ξ(G) = ∑ v∈VG εG(v)DG(v), where εG(v) is the eccentricity of the vertex v and DG(v) = ∑ u∈VG dG(u, v) is the sum of all distances from the vertex v. In this paper the tree among n-vertex trees with domination number γ having the minimal eccentric distance sum is determined and the tree among n-...
متن کاملThe Hyper-Zagreb Index of Trees and Unicyclic Graphs
Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2011
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2010.08.054